Heuristics on pairing-friendly abelian varieties
نویسندگان
چکیده
منابع مشابه
Heuristics on pairing-friendly elliptic curves
We present a heuristic asymptotic formula as x → ∞ for the number of isogeny classes of pairing-friendly elliptic curves over prime fields with fixed embedding degree k ≥ 3, with fixed discriminant, with rho-value bounded by a fixed ρ0 such that 1 < ρ0 < 2, and with prime subgroup order at most x.
متن کاملEfficient pairing computation on supersingular Abelian varieties
We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises results of Duursma and Lee for computing the Tate pairing on supersingular elliptic curves in characteristic three. We then show how our general technique leads to a new algorithm which is about twice as fast as the Duursma-Lee...
متن کاملOn the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
Let A be an abelian variety defined over a non-prime finite field Fq that has embedding degree k with respect to a subgroup of prime order r. In this paper we give explicit conditions on q, k, and r that imply that the minimal embedding field of A with respect to r is Fqk . When these conditions hold, the embedding degree k is a good measure of the security level of a pairing-based cryptosystem...
متن کاملConstructing Abelian Varieties for Pairing-Based Cryptography
Constructing Abelian Varieties for Pairing-Based Cryptography
متن کاملA Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
We give an algorithm that produces families of Weil numbers for ordinary abelian varieties over finite fields with prescribed embedding degree. The algorithm uses the ideas of Freeman, Stevenhagen, and Streng to generalize the Brezing-Weng construction of pairing-friendly elliptic curves. We discuss how CM methods can be used to construct these varieties, and we use our algorithm to give exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2015
ISSN: 1461-1570
DOI: 10.1112/s1461157015000091